Coloured Petri net scheduling models: Timed state space exploration shortages

نویسندگان

  • Miquel Angel Piera Eroles
  • G. Music
چکیده

The paper deals with the problem of timed state space generation and exploration in the frame of simulation–optimization pproach for discrete-event systems. Coloured Petri net representation of a system is considered and corresponding techniques f timed state space generation and timed simulation are addressed. It is shown that the established simulation techniques do not erform adequately in some application relevant examples since in general, only a subset of a timed state space of a simulated ystem is represented. Two examples are provided to illustrate the effect of timed state space reduction. While the optimal solution s preserved within the reduced state space in one example, in the second example this is not the case and the optimum is missed. his indicates that the timed simulation technique has to be carefully designed in order to be suitable for the simulation–optimization pproach. 2010 IMACS. Published by Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revisiting state space exploration of timed coloured petri net models to optimize manufacturing system's performance

Due to constant fluctuations in market demands, nowadays scheduling of flexible manufacturing systems is taking great importance to improve competitiveness. Coloured Petri Nets (CPN) is a high level modelling formalism which have been widely used to model and verify systems, allowing representing not only the system’s dynamic behaviour but also the information flow. One approach that focuses in...

متن کامل

Equivalent Coloured Petri Net Models of a Class of Timed Influence Nets with Logic

This paper discusses coloured Petri net models of so-called timed influence nets with logic. Previous work has developed a method to translate a timed influence net into a coloured Petri net. The work in this paper describes a new and more compact translation from timed influence nets with logic into coloured Petri nets. The translation has the property that the net structure of the coloured Pe...

متن کامل

A Sweep-Line Method for State Space Exploration

We present a state space exploration method for on-the-fly verification. The method is aimed at systems for which it is possible to define a measure of progress based on the states of the system. The measure of progress makes it possible to delete certain states on-the-fly during state space generation, since these states can never be reached again. This in turn reduces the memory used for stat...

متن کامل

M–timed Petri Nets, Priorities, Preemptions, and Performance Evaluation of Systems

In M–timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M–timed Petri nets are discussed in this paper to show increasing “modelling power” of different nets. Conflict–free nets can model M and Ek–type queueing systems. Free—choice nets can also represent Hk–type systems. Systems with several classes of users an...

متن کامل

An Approach to Distributed State Space Exploration for Coloured Petri Nets

We present an approach and associated computer tool support for conducting distributed state space exploration for Coloured Petri Nets (CPNs). The distributed state space exploration is based on the introduction of a coordinating process and a number of worker processes. The worker processes are responsible for the storage of states and the computation of successor states. The coordinator proce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics and Computers in Simulation

دوره 82  شماره 

صفحات  -

تاریخ انتشار 2011